0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.16/0.36	% Computer   : n011.cluster.edu
0.16/0.36	% Model      : x86_64 x86_64
0.16/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.16/0.36	% Memory     : 8042.1875MB
0.16/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.16/0.36	% CPULimit   : 1200
0.16/0.36	% WCLimit    : 120
0.16/0.36	% DateTime   : Tue Jul 13 11:16:40 EDT 2021
0.16/0.37	% CPUTime    : 
0.16/0.37	% Number of cores: 8
0.16/0.37	% Python version: Python 3.6.8
0.16/0.37	# Version: 2.6rc1-ho
0.23/0.39	# No SInE strategy applied
0.23/0.39	# Trying AutoSched0 for 59 seconds
0.23/0.48	# AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V
0.23/0.48	# and selection function PSelectComplexExceptRRHorn.
0.23/0.48	#
0.23/0.48	# Preprocessing time       : 0.090 s
0.23/0.48	
0.23/0.48	# Proof found!
0.23/0.48	# SZS status Theorem
0.23/0.48	# SZS output start CNFRefutation
0.23/0.48	thf(fact_62_rev__finite__subset, axiom, ![X8:set_nat_nat, X7:set_nat_nat]:(finite570312790at_nat @ X8=>(ord_le1415039317at_nat @ X7 @ X8=>finite570312790at_nat @ X7)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_62_rev__finite__subset)).
0.23/0.48	thf(fact_1__092_060open_062_123p_O_Ap_Apartitions_An_125_A_092_060subseteq_062_A_123f_O_A_I_092_060forall_062i_O_Af_Ai_A_092_060le_062_An_J_A_092_060and_062_A_I_092_060forall_062i_092_060ge_062n_A_L_A1_O_Af_Ai_A_061_A0_J_125_092_060close_062, axiom, ord_le1415039317at_nat @ (collect_nat_nat @ (^[X404:nat > nat]:number1551313001itions @ X404 @ n)) @ (collect_nat_nat @ (^[X405:nat > nat]:(![X34:nat]:((X405 @ X34)=(zero_zero_nat)<=ord_less_eq_nat @ (plus_plus_nat @ n @ one_one_nat) @ X34)&![X34:nat]:ord_less_eq_nat @ (X405 @ X34) @ n))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_1__092_060open_062_123p_O_Ap_Apartitions_An_125_A_092_060subseteq_062_A_123f_O_A_I_092_060forall_062i_O_Af_Ai_A_092_060le_062_An_J_A_092_060and_062_A_I_092_060forall_062i_092_060ge_062n_A_L_A1_O_Af_Ai_A_061_A0_J_125_092_060close_062)).
0.23/0.48	thf(fact_0__092_060open_062finite_A_123f_O_A_I_092_060forall_062i_O_Af_Ai_A_092_060le_062_An_J_A_092_060and_062_A_I_092_060forall_062i_092_060ge_062n_A_L_A1_O_Af_Ai_A_061_A0_J_125_092_060close_062, axiom, finite570312790at_nat @ (collect_nat_nat @ (^[X237:nat > nat]:(![X34:nat]:((X237 @ X34)=(zero_zero_nat)<=ord_less_eq_nat @ (plus_plus_nat @ n @ one_one_nat) @ X34)&![X34:nat]:ord_less_eq_nat @ (X237 @ X34) @ n))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0__092_060open_062finite_A_123f_O_A_I_092_060forall_062i_O_Af_Ai_A_092_060le_062_An_J_A_092_060and_062_A_I_092_060forall_062i_092_060ge_062n_A_L_A1_O_Af_Ai_A_061_A0_J_125_092_060close_062)).
0.23/0.48	thf(conj_0, conjecture, finite570312790at_nat @ (collect_nat_nat @ (^[X404:nat > nat]:number1551313001itions @ X404 @ n)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
0.23/0.48	thf(c_0_4, plain, ![X237:nat > nat]:(epred27_1 @ X237<=>(![X34:nat]:(ord_less_eq_nat @ (plus_plus_nat @ n @ one_one_nat) @ X34=>(X237 @ X34)=(zero_zero_nat))&![X34:nat]:ord_less_eq_nat @ (X237 @ X34) @ n)), inference(fof_simplification,[status(thm)],[introduced(definition)])).
0.23/0.48	thf(c_0_5, plain, ![X404:nat > nat]:(epred53_1 @ X404<=>number1551313001itions @ X404 @ n), introduced(definition)).
0.23/0.48	thf(c_0_6, plain, ![X2367:set_nat_nat, X2368:set_nat_nat]:(~finite570312790at_nat @ X2367|(~ord_le1415039317at_nat @ X2368 @ X2367|finite570312790at_nat @ X2368)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_62_rev__finite__subset])])).
0.23/0.48	thf(c_0_7, axiom, ord_le1415039317at_nat @ (collect_nat_nat @ epred53_1) @ (collect_nat_nat @ epred27_1), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[fact_1__092_060open_062_123p_O_Ap_Apartitions_An_125_A_092_060subseteq_062_A_123f_O_A_I_092_060forall_062i_O_Af_Ai_A_092_060le_062_An_J_A_092_060and_062_A_I_092_060forall_062i_092_060ge_062n_A_L_A1_O_Af_Ai_A_061_A0_J_125_092_060close_062, c_0_4]), c_0_5])).
0.23/0.48	thf(c_0_8, axiom, finite570312790at_nat @ (collect_nat_nat @ epred27_1), inference(apply_def,[status(thm)],[fact_0__092_060open_062finite_A_123f_O_A_I_092_060forall_062i_O_Af_Ai_A_092_060le_062_An_J_A_092_060and_062_A_I_092_060forall_062i_092_060ge_062n_A_L_A1_O_Af_Ai_A_061_A0_J_125_092_060close_062, c_0_4])).
0.23/0.48	thf(c_0_9, negated_conjecture, ~finite570312790at_nat @ (collect_nat_nat @ epred53_1), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0]), c_0_5])])).
0.23/0.48	thf(c_0_10, plain, ![X8:set_nat_nat, X7:set_nat_nat]:(finite570312790at_nat @ X8|~finite570312790at_nat @ X7|~ord_le1415039317at_nat @ X8 @ X7), inference(split_conjunct,[status(thm)],[c_0_6])).
0.23/0.48	thf(c_0_11, plain, ord_le1415039317at_nat @ (collect_nat_nat @ epred53_1) @ (collect_nat_nat @ epred27_1), inference(split_conjunct,[status(thm)],[c_0_7])).
0.23/0.48	thf(c_0_12, plain, finite570312790at_nat @ (collect_nat_nat @ epred27_1), inference(split_conjunct,[status(thm)],[c_0_8])).
0.23/0.48	thf(c_0_13, negated_conjecture, ~finite570312790at_nat @ (collect_nat_nat @ epred53_1), inference(split_conjunct,[status(thm)],[c_0_9])).
0.23/0.48	thf(c_0_14, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])]), c_0_13]), ['proof']).
0.23/0.48	# SZS output end CNFRefutation
0.23/0.48	# Proof object total steps             : 15
0.23/0.48	# Proof object clause steps            : 5
0.23/0.48	# Proof object formula steps           : 10
0.23/0.48	# Proof object conjectures             : 3
0.23/0.48	# Proof object clause conjectures      : 1
0.23/0.48	# Proof object formula conjectures     : 2
0.23/0.48	# Proof object initial clauses used    : 4
0.23/0.48	# Proof object initial formulas used   : 4
0.23/0.48	# Proof object generating inferences   : 1
0.23/0.48	# Proof object simplifying inferences  : 3
0.23/0.48	# Training examples: 0 positive, 0 negative
0.23/0.48	# Parsed axioms                        : 429
0.23/0.48	# Removed by relevancy pruning/SinE    : 0
0.23/0.48	# Initial clauses                      : 994
0.23/0.48	# Removed in clause preprocessing      : 92
0.23/0.48	# Initial clauses in saturation        : 902
0.23/0.48	# Processed clauses                    : 182
0.23/0.48	# ...of these trivial                  : 12
0.23/0.48	# ...subsumed                          : 24
0.23/0.48	# ...remaining for further processing  : 146
0.23/0.48	# Other redundant clauses eliminated   : 44
0.23/0.48	# Clauses deleted for lack of memory   : 0
0.23/0.48	# Backward-subsumed                    : 0
0.23/0.48	# Backward-rewritten                   : 3
0.23/0.48	# Generated clauses                    : 108
0.23/0.48	# ...of the previous two non-trivial   : 46
0.23/0.48	# Contextual simplify-reflections      : 0
0.23/0.48	# Paramodulations                      : 23
0.23/0.48	# Factorizations                       : 0
0.23/0.48	# NegExts                              : 0
0.23/0.48	# Equation resolutions                 : 44
0.23/0.48	# Propositional unsat checks           : 0
0.23/0.48	#    Propositional check models        : 0
0.23/0.48	#    Propositional check unsatisfiable : 0
0.23/0.48	#    Propositional clauses             : 0
0.23/0.48	#    Propositional clauses after purity: 0
0.23/0.48	#    Propositional unsat core size     : 0
0.23/0.48	#    Propositional preprocessing time  : 0.000
0.23/0.48	#    Propositional encoding time       : 0.000
0.23/0.48	#    Propositional solver time         : 0.000
0.23/0.48	#    Success case prop preproc time    : 0.000
0.23/0.48	#    Success case prop encoding time   : 0.000
0.23/0.48	#    Success case prop solver time     : 0.000
0.23/0.48	# Current number of processed clauses  : 99
0.23/0.48	#    Positive orientable unit clauses  : 21
0.23/0.48	#    Positive unorientable unit clauses: 0
0.23/0.48	#    Negative unit clauses             : 4
0.23/0.48	#    Non-unit-clauses                  : 74
0.23/0.48	# Current number of unprocessed clauses: 766
0.23/0.48	# ...number of literals in the above   : 2216
0.23/0.48	# Current number of archived formulas  : 0
0.23/0.48	# Current number of archived clauses   : 3
0.23/0.48	# Clause-clause subsumption calls (NU) : 1462
0.23/0.48	# Rec. Clause-clause subsumption calls : 1252
0.23/0.48	# Non-unit clause-clause subsumptions  : 24
0.23/0.48	# Unit Clause-clause subsumption calls : 128
0.23/0.48	# Rewrite failures with RHS unbound    : 0
0.23/0.48	# BW rewrite match attempts            : 6
0.23/0.48	# BW rewrite match successes           : 3
0.23/0.48	# Condensation attempts                : 182
0.23/0.48	# Condensation successes               : 0
0.23/0.48	# Termbank termtop insertions          : 64974
0.23/0.48	
0.23/0.48	# -------------------------------------------------
0.23/0.48	# User time                : 0.099 s
0.23/0.48	# System time              : 0.015 s
0.23/0.48	# Total time               : 0.114 s
0.23/0.48	# Maximum resident set size: 2684 pages
0.23/0.49	EOF